Heuristics: Intelligent Search Strategies for Com- Puter Problem
نویسنده
چکیده
his competence. The author points out that “the ascription schema constrains mental ascriptions once a system is specified; but it puts no limit on which systems should have mental states ascribed to them.” He postulates a “Supertrap” which strikes matches in the presence of gassoaked mice, topples dictionaries on mice, and, of course, snaps shut whenever mice nibble its bait “These habits betray a common malevolent thread, which is generalizable by (and only by) ascribing a persistent goal: dead mice.” When we see other Supertrap behaviors, such as failure to harm cats that reek of gasoline, we become involved in a “semantic intrigue,” an effort to understand how mental ascriptions cohere and interact. Whimsical examples aside, ascription is important for AI because it provides one more way to detect patterns that might otherwise go unnoticed. The ascription schema is proposed during the author’s discussion of people’s pragmatic sense. The final chapter also examines other fundamental differences between people and programs: our use of mental images, feelings, and ego involvement. Even if this chapter were not as thought-provoking and enjoyable as it is, it would be worth reading simply to remind oneself how extremely difficult problems in AI can (should?) be.
منابع مشابه
Heuristics - intelligent search strategies for computer problem solving
Find loads of the heuristics intelligent search strategies for computer problem solving book catalogues in this site as the choice of you visiting this page. You can also join to the website book library that will show you numerous books from any types. Literature, science, politics, and many more catalogues are presented to offer you the best book to find. The book that really makes you feels ...
متن کاملFIXED-WEIGHT EIGENVALUE OPTIMIZATION OF TRUSS STRUCTURES BY SWARM INTELLIGENT ALGORITHMS
Meta-heuristics have already received considerable attention in various engineering optimization fields. As one of the most rewarding tasks, eigenvalue optimization of truss structures is concerned in this study. In the proposed problem formulation the fundamental eigenvalue is to be maximized for a constant structural weight. The optimum is searched using Particle Swarm Optimization, PSO and i...
متن کاملLabel Propagation for Hypergraph Partitioning
Many problems in computer science can be represented by a graph and reducedto a graph clustering or k-way partitioning problem. In the classical definition,a graph consists of nodes and edges which usually connect exactly two nodes.Hypergraphs are a generalization of graphs, where every edge can connect anarbitrary number of nodes. Recent results suggest that some problems i...
متن کاملIntelligent Tuned Harmony Search for Solving Economic Dispatch Problem with Valve-point Effects and Prohibited Operating Zones
Economic dispatch with valve point effect and Prohibited Operating Zones (POZs) is a non-convex and discontinuous optimization problem. Harmony Search (HS) is one of the recently presented meta-heuristic algorithms for solving optimization problems, which has different variants. The performances of these variants are severely affected by selection of different parameters of the algorithm. Intel...
متن کاملInvestigations into Satisfiability Search
In this dissertation we investigate theoretical aspects of some practical approaches used in solving and understanding search problems. We concentrate on the Satisfiability problem, which is a strong representative from search problem domains. The work develops general theoretical foundations to investigate some practical aspects of satisfiability search. This results in a better understanding ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001